Sets of Weak Exponents of Indecomposability for Irreducible Boolean Matrices
نویسندگان
چکیده
Let IBn be the set of all irreducible matrices in Bn and let SIBn be the set of all symmetric matrices in IBn. Finding an upper bound for the set of indices of matrices in IBn and SIBn and determining gaps in the set of indices of matrices in IBn and SIBn has been studied by many researchers. In this paper, we establish a best upper bound for the set of weak exponents of indecomposability of matrices in SIBn and IBn, and show that there does not exist a gap in the set of weak exponents of indecomposability for any of class SIBn and class IBn.
منابع مشابه
Power Indices of Trace Zero Symmetric Boolean Matrices
The power index of a square Boolean matrix A is the least integer d such that A is a linear combination of previous nonnegative powers of A. We determine the maximum power indices for the class of n × n primitive symmetric Boolean matrices of trace zero, the class of n × n irreducible nonprimitive symmetric Boolean matrices, and the class of n×n reducible symmetric Boolean matrices of trace zer...
متن کاملOn the Gaps in the Set of Exponents of Boolean Primitive Circulant
In this paper we consider the problem of describing the possible exponents of boolean primitive circulant matrices. We give a conjecture for the possible such exponents and prove this conjecture in several cases. In particular, we consider in greater detail the case of matrices whose generating vector has three nonzero entries.
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملIndecomposability of Polynomials via Jacobian Matrix
Indecomposable polynomials are a special class of absolutely irreducible polynomials. Some improvements of important effective results on absolute irreducibility have recently appeared using Ruppert’s matrix. In a similar way, we show in this paper that the use of a Jacobian matrix gives sharp bounds for the indecomposability problem.
متن کامل